全文获取类型
收费全文 | 8341篇 |
免费 | 1162篇 |
国内免费 | 675篇 |
专业分类
电工技术 | 253篇 |
综合类 | 920篇 |
化学工业 | 1265篇 |
金属工艺 | 302篇 |
机械仪表 | 721篇 |
建筑科学 | 453篇 |
矿业工程 | 92篇 |
能源动力 | 401篇 |
轻工业 | 131篇 |
水利工程 | 188篇 |
石油天然气 | 309篇 |
武器工业 | 107篇 |
无线电 | 556篇 |
一般工业技术 | 979篇 |
冶金工业 | 194篇 |
原子能技术 | 160篇 |
自动化技术 | 3147篇 |
出版年
2024年 | 39篇 |
2023年 | 145篇 |
2022年 | 248篇 |
2021年 | 265篇 |
2020年 | 295篇 |
2019年 | 323篇 |
2018年 | 268篇 |
2017年 | 320篇 |
2016年 | 330篇 |
2015年 | 386篇 |
2014年 | 478篇 |
2013年 | 581篇 |
2012年 | 495篇 |
2011年 | 572篇 |
2010年 | 453篇 |
2009年 | 461篇 |
2008年 | 455篇 |
2007年 | 560篇 |
2006年 | 440篇 |
2005年 | 418篇 |
2004年 | 357篇 |
2003年 | 269篇 |
2002年 | 285篇 |
2001年 | 225篇 |
2000年 | 211篇 |
1999年 | 170篇 |
1998年 | 151篇 |
1997年 | 124篇 |
1996年 | 105篇 |
1995年 | 98篇 |
1994年 | 104篇 |
1993年 | 77篇 |
1992年 | 67篇 |
1991年 | 59篇 |
1990年 | 37篇 |
1989年 | 49篇 |
1988年 | 26篇 |
1987年 | 26篇 |
1986年 | 23篇 |
1985年 | 29篇 |
1984年 | 21篇 |
1983年 | 29篇 |
1982年 | 21篇 |
1981年 | 12篇 |
1980年 | 17篇 |
1979年 | 18篇 |
1978年 | 10篇 |
1976年 | 5篇 |
1959年 | 7篇 |
1951年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
In architectural design, surface shapes are commonly subject to geometric constraints imposed by material, fabrication or assembly. Rationalization algorithms can convert a freeform design into a form feasible for production, but often require design modifications that might not comply with the design intent. In addition, they only offer limited support for exploring alternative feasible shapes, due to the high complexity of the optimization algorithm.We address these shortcomings and present a computational framework for interactive shape exploration of discrete geometric structures in the context of freeform architectural design. Our method is formulated as a mesh optimization subject to shape constraints. Our formulation can enforce soft constraints and hard constraints at the same time, and handles equality constraints and inequality constraints in a unified way. We propose a novel numerical solver that splits the optimization into a sequence of simple subproblems that can be solved efficiently and accurately.Based on this algorithm, we develop a system that allows the user to explore designs satisfying geometric constraints. Our system offers full control over the exploration process, by providing direct access to the specification of the design space. At the same time, the complexity of the underlying optimization is hidden from the user, who communicates with the system through intuitive interfaces. 相似文献
2.
Creating the brain and interacting with the brain: an integrated approach to understanding the brain
In the past two decades, brain science and robotics have made gigantic advances in their own fields, and their interactions have generated several interdisciplinary research fields. First, in the ‘understanding the brain by creating the brain’ approach, computational neuroscience models have been applied to many robotics problems. Second, such brain-motivated fields as cognitive robotics and developmental robotics have emerged as interdisciplinary areas among robotics, neuroscience and cognitive science with special emphasis on humanoid robots. Third, in brain–machine interface research, a brain and a robot are mutually connected within a closed loop. In this paper, we review the theoretical backgrounds of these three interdisciplinary fields and their recent progress. Then, we introduce recent efforts to reintegrate these research fields into a coherent perspective and propose a new direction that integrates brain science and robotics where the decoding of information from the brain, robot control based on the decoded information and multimodal feedback to the brain from the robot are carried out in real time and in a closed loop. 相似文献
3.
The acquisition of new skills over a life span is a remarkable human ability. This ability, however, is constrained by age of acquisition (AoA); that is, the age at which learning occurs significantly affects the outcome. This is most clearly reflected in domains such as language, music, and athletics. This article provides a perspective on the neural and computational mechanisms underlying AoA in language acquisition. The authors show how AoA modulates both monolingual lexical processing and bilingual language acquisition. They consider the conditions under which syntactic processing and semantic processing may be differentially sensitive to AoA effects in second-language acquisition. The authors conclude that AoA effects are pervasive and that the neural and computational mechanisms underlying learning and sensorimotor integration provide a general account of these effects. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
4.
This is the first time an extensive investigation has been carried out regarding the effects of riser exit geometry on pressure drop and solid behaviour inside the Internal Circulating Fluidized Bed (ICFB) riser, using different riser exit geometries at several operating conditions.The Radioactive Particle-Tracking (RPT) technique was used for solid concentration measurements and solid residence time distribution at the exit zone. Experiments were conducted using Geldart B particles, in the gas superficial velocity range of 4 to 10 m/s. Axial solid hold-up, solid residence time distribution in the exit zone, and the reflux ratio factor km, (defined earlier by [E.H. Van der Meer, R.B. Thorpe, J.F. Davidson, Flow patterns in the square cross-section riser of a circulating fluidized bed and the effect of riser exit design, Chem. Eng. Sc. 55 (19) (2000) 4079-4099]), were the main criteria used to investigate the impact of gas-solid separator devices implemented at the ICFB riser exit.Solid residence time distribution results and axial solid hold-up profiles provided clear evidence that the separator device at the riser exit strongly influences the hydrodynamic structure of the ICFB riser. The V-shaped riser exit geometry was found to be the optimum of all the configurations studied. 相似文献
5.
Vladlen Koltun 《Information Processing Letters》2004,89(5):233-235
It is an outstanding open problem of computational geometry to prove a near-quadratic upper bound on the number of combinatorial changes in the Voronoi diagram of points moving at a common constant speed along linear trajectories in the plane. In this note we observe that this quantity is Θ(n2) if the points start their movement from a common line. 相似文献
6.
John Watrous 《Computational Complexity》2003,12(1-2):48-84
This paper studies the space-complexity of predicting the
long-term behavior of a class of stochastic processes based on evolutions
and measurements of quantum mechanical systems. These processes
generalize a wide range of both quantum and classical space-bounded
computations, including unbounded error computations given by machines
having algebraic number transition amplitudes or probabilities.
It is proved that any space s quantum stochastic process from this class
can be simulated probabilistically with unbounded error in space O(s),
and therefore deterministically in space O(s2). 相似文献
7.
Local Exact Particle Tracing on Unstructured Grids 总被引:1,自引:0,他引:1
For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation 相似文献
8.
An increasing number of connectionist models have been proposed to explain behavioral deficits in developmental disorders. These simulations motivate serious consideration of the theoretical implications of the claim that a developmental disorder fits within the parameter space of a particular computational model of normal development. The authors examine these issues in depth with respect to a series of new simulations investigating past-tense formation in Williams syndrome. This syndrome and the past-tense domain are highly relevant because both have been used to make strong theoretical claims about the processes underlying normal language acquisition. The authors conclude that computational models have great potential to advance psychologists' understanding of developmental deficits because they focus on the developmental process itself as a pivotal causal factor in producing atypical phenotypic outcomes. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
9.
周培德 《计算机辅助设计与图形学学报》2002,14(3):287-288
周培协三角剖分是否能得到最小权三角剖分,周培德在《周培德三角部分不是最小权三角剖分》一文撰写之前已有新的结论,本文还指出《周培德三角剖分不是最小权三角剖分》一文所举反例不成立。 相似文献
10.
Reconstruction of an original continuous curve and the estimation of its parameters from the digitized version of the curve
is a challenging problem, as quantization always causes some loss of information. In this paper, we have developed a scheme
for reconstruction which is applicable to a class of curves having at the most two parameters. The class of curves for which
the scheme works has also been characterized. We have shown that for one-parameter curves the exact domain of values of the
parameter can be obtained. But in the two-parameter case, only the smallest rectangle containing the domain can be realised.
The distinctive feature of our scheme is that it provides a unified approach to solve the reconstruction and the domain-finding
problem for a class of curves. 相似文献